Fréchet Distance Problems in Weighted Regions
نویسندگان
چکیده
We discuss two versions of the Fréchet distance problem in weighted planar subdivisions. In the first one, the distance between two points is the weighted length of the line segment joining the points. In the second one, the distance between two points is the length of the shortest path between the points. In both cases, we give algorithms for finding a (1 + ǫ)-factor approximation of the Fréchet distance between two polygonal curves. We also consider the Fréchet distance between two polygonal curves among polyhedral obstacles in R (1/ ∞ weighted region problem) and present a (1 + ǫ)-factor approximation algorithm.
منابع مشابه
The Fréchet Distance Problem in Weighted Regions
where α and β range over all continuous non-decreasing functions with α(0) = β(0) = 0 and α(1) = β(1) = 1, and d′ is a distance metric between points. The functions α and β are also refereed to as reparametrizations. We call (α, β) a matching between P and Q. The Fréchet distance is described intuitively by a man walking a dog on a leash. The man follows a curve (path), and the dog follows anot...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کاملFast Fréchet Distance Between Curves With Long Edges
Computing Fréchet distance between two curves takes roughly quadratic time. In this paper, we show that for curves with long edges the Fréchet distance computations become easier. Let P and Q be two polygonal curves in R with n and m vertices, respectively. We prove four main results for the case when all edges of both curves are long compared to the Fréchet distance between them: (1) a linear-...
متن کاملWeighted Minimum Backward Frechet Distance
The minimum backward Fréchet distance (MBFD) problem is a natural optimization problem for the weak Fréchet distance, a variant of the well-known Fréchet distance. In this problem, a threshold ε and two polygonal curves, T1 and T2, are given. The objective is to find a pair of walks on T1 and T2, which minimizes the union of the portions of backward movements while the distance between the movi...
متن کاملFolding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution)
By folding the free-space diagram for efficient preprocessing, we show that the Fréchet distance between 1D curves can be computed in O(nk logn) time, assuming one curve has ply k. 1998 ACM Subject Classification F.2.2 [Nonnumerical Algorithms and Problems] Geometrical Problems and Computations
متن کامل